Maximizing Real-Time System Utilization by Adjusting Task Computation Times

نویسندگان

  • Samee U. Khan
  • Lizhe Wang
  • N. Min-Allah
چکیده

A real-time system is any information processing system that has to respond to externally generated input stimuli within a finite and specified period: the correctness depends not only on the logical result but also on the time it was delivered; the failure to respond is as bad as the wrong response [1]. Real-time systems can be constructed out of sequential programs but are typically built from concurrent programs called tasks. A real-time task is an executable entity of work that, at a minimum, is characterized by the worst-case execution time (WCET) [2] and time constraints [3]. The WCET is estimated as the maximal time required by the processor to execute the task. A typical timing constraint of a real-time task is the deadline, which is defined as the maximal completion time of a task without causing any damage to the system [4–6]. There are two main classes of real-time system: (1) hard and (2) soft real-time systems. The hard real-time must meet its deadlines. In case of failure, its operation is without value and the system for which it is a component is of no use. Embedded systems are often hard real-time systems. Such systems have practical applications 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Integrated Heuristic Approach to Power-Aware Real-Time Scheduling

In this paper we propose a novel scheduling framework for a dynamic real-time environment that experiences power consumption constraints. This framework is capable of dynamically adjusting the voltage/speed of the system, such that no task in the system misses its deadline and the total energy savings of the system are maximized. Each task in the system consumes a certain amount of energy, whic...

متن کامل

Optimal Discrete Rate Adaptation for Distributed Real-Time Systems with End-to-End Tasks

Many distributed real-time systems face the challenge of dynamically maximizing system utility in response to fluctuations in system workload. We present the MultiParametric Rate Adaptation (MPRA) algorithm for discrete rate adaptation in distributed real-time systems with end-to-end tasks. The key novelty and advantage of MPRA is that it can efficiently produce optimal solutions in response to...

متن کامل

Modeling of a Probabilistic Re-Entrant Line Bounded by Limited Operation Utilization Time

This paper presents an analytical model based on mean value analysis (MVA) technique for a probabilistic re-entrant line. The objective is to develop a solution method to determine the total cycle time of a Reflow Screening (RS) operation in a semiconductor assembly plant. The uniqueness of this operation is that it has to be borrowed from another department in order to perform the production s...

متن کامل

A Schedulable Utilization Bound for Aperiodic Tasks

In this paper, we derive a utilization bound on schedulability of apriodic tasks with arbitrary arrival times, execution times, and deadlines. To the author's knowledge, this is the rst time a utilization bound is derived for the aperiodic task model. It allows constructing an O(1) admission test for aperiodic tasks. Earlier admission tests are at best O(n). We show that deadline-monotonic sche...

متن کامل

Probabilistic Performance Guarantee for Real - Time Tasks

This paper describes how the scheduling algorithms and schedulability analysis methods developed for periodic tasks can be extended to provide performance guarantees to semi-periodic tasks. Like periodic tasks, the requests in a semi-periodic task are released regularly. However, their computation times vary widely. We focus on systems where the total maximum utilization of the tasks on each pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012